On indexing evidential data
نویسندگان
چکیده
منابع مشابه
On the Relationship Between Evidential Structures and Data Tables
In this paper, we would like to investigate the relationship between evidential structures (ES)—the basic qualitative structures of Dempster-Shafer theory, and the data table based knowledge representation systems(KRS) subject to rough set analysis. It is shown that an ES has a natural representation as a data table and from a given data table and two of its attributes, an ES can be extracted. ...
متن کاملEvidential supplier selection based on interval data fusion
Supplier selection is a typical multi-criteria decision making(MCDM) problem and lots of uncertain information exist inevitably. To address this issue, a new method was proposed based on interval data fusion. Our method follows the original way to generate classical basic probability assignment(BPA) determined by the distance among the evidences. However, the weights of criteria are kept as int...
متن کاملOn-demand Indexing for Large Scientific Data
Enabling search alleviates the need for manual file management, allowing users to find files by the features that are most relevant to them. Despite the need for a comprehensive file system search, most file system indexing work has focused on adapting existing solutions such as the RDBMS or spatial trees to index files. Although a step in the right direction these approaches have focused their...
متن کاملOn Indexing High Dimensional Data with Uncertainty
In this paper, we will examine the problem of distance function computation and indexing uncertain data in high dimensionality for nearest neighbor and range queries. Because of the inherent noise in uncertain data, traditional distance function measures such as the Lqmetric and their probabilistic variants are not qualitatively effective. This problem is further magnified by the sparsity issue...
متن کاملEvidential clustering of large dissimilarity data
In evidential clustering, the membership of objects to clusters is considered to be uncertain and is represented by Dempster-Shafer mass functions, forming a credal partition. The EVCLUS algorithm constructs a credal partition in such a way that larger dissimilarities between objects correspond to higher degrees of conflict between the associated mass functions. In this paper, we present severa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2019
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2018.12.015